Generic-point parallel scalar multiplication without precomputations
نویسندگان
چکیده
The first efficient generic-point parallel scalar multiplication method is presented here. The novelty of the proposed method is that the precomputation overhead can be replaced by postcomputations that can be parallelised. This method will be very attractive for use in high-performance end servers that employ parallel elliptic curve cryptoprocessors.
منابع مشابه
Performance Analysis of the Postcomputation- Based Generic-Point Parallel Scalar Multiplication Method
A Postcomputation-based generic-point parallel scalar multiplication method has recently been proposed for high-performance end servers that employ parallel elliptic curve cryptoprocessors. The sequential precomputation overheads, in the postcomputation-based method, are replaced with parallelizable postcomputations. This paper analyzes the performance of the postcomputation-based method with 1...
متن کاملNew Multibase Non-Adjacent Form Scalar Multiplication and its Application to Elliptic Curve Cryptosystems (extended version)
Patrick Longa is with the Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada (e-mail: [email protected]). Ali Miri is with the School of Information and Technology Engineering (SITE), University of Ottawa, Ottawa, Canada (e-mail: [email protected]). Abstract. In this paper we present a new method for scalar multiplication that uses a generic multi...
متن کاملFast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
Recently, the new Multibase Non-Adjacent Form (mbNAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases to represent the scalar. In this work, we first optimize the previous method using fractional windows, and then introduce further improvements to achieve additional cost reductions. Moreover, we present new improveme...
متن کاملA Novel and Efficient Hardware Implementation of Scalar Point Multiplier
A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...
متن کاملSingle-Trace Side-Channel Attacks on Scalar Multiplications with Precomputations
Single-trace side-channel attacks are a serious threat to elliptic curve cryptography in practice because they can break also cryptosystems where scalars are nonces (e.g., ECDSA). Previously it was believed that single-trace attacks can be avoided by using scalar multiplication algorithms with regular patterns of operations but recently we have learned that they can be broken with correlation t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Electronic Express
دوره 6 شماره
صفحات -
تاریخ انتشار 2009